-
1 dining philosophers' problem
Универсальный англо-русский словарь > dining philosophers' problem
-
2 dining philosophers' problem
сист. задача об обедающих философах ( модель для анализа тупиковых ситуаций в системах параллельных процессов)English-Russian dictionary of computer science and programming > dining philosophers' problem
-
3 dining philosophers problem
= DPPпроблема обедающих философов; проблема распределения ресурсов и исключения тупиковеё сформулировал и решил Дейкстра (Edsger Dijkstra): несколько очень тактичных философов расположились за круглым столом с большой тарелкой спагетти посредине. Спагетти настолько скользкие, что философу нужны две вилки, чтобы их есть. Между философами лежит по вилке. Жизнь философов состоит из периодов размышления и еды. Когда философ проголодается, он пытается взять вилки. Если это ему удаётся, он некоторое время ест, затем их кладёт и продолжает думать. Проблема заключается в алгоритме синхронизации доступа к вилкам, чтобы все философы могли поестьАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > dining philosophers problem
-
4 problem
задача; проблема- accounting problem
- allocation problem
- assignment problem
- ballot problem
- benchmark problem
- blending problem
- bottleneck problem
- boundary-value problem
- boundary problem
- business problem
- Byzantine Generals problem
- center problem
- check problem
- chess problem
- commonly encountered problem
- computational problem
- continuum problem
- covering problem
- data problem
- data-set problem
- daunting problem
- decision problem
- deducibility problem
- design problem
- dining philosophers' problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- estimation problem
- EVA problem
- extremely ill-conditioned problem
- fault-location problem
- filtering problem
- findpath problem
- finger-pointing problem
- flow problem
- frame problem
- free-boundary problem
- game-theory problem
- game problem
- graph theoretic problem
- graphics problem
- ill-conditioned problem
- ill-defined problem
- ill-posed problem
- inference problem
- information retrieval problem
- initial value problem
- intractable problem
- job-shop problem
- knapsack problem
- Konigsberg bridge problem
- labyrinth problem
- location problem
- logical problem
- management problem
- market analysis problem
- marriage problem
- maximum flow problem
- maximum network flow problem
- mildly ill-posed problem
- minimal connector problem
- model problem
- multivariate problem
- newspaper-boy problem
- ninety percent complete problem
- nominal design problem
- off-by-one problem
- omelet problem
- one-sample problem
- postman problem
- programming problem
- projection problem
- pursuit problem
- quadratic assignment problem
- queuing problem
- race problem
- ramification problem
- real-time problem
- real-world problem
- reducibility problem
- resource allocation problem
- routing problem
- ruin problem
- satisfiability problem
- scheduling problem
- search problem
- severely ill-posed problem
- shortest route problem
- simulated problem
- software problem
- sparse problem
- stale data problem
- stochastic problem
- switchbox routing problem
- switchbox problem
- target assignment problem
- test problem
- three-dimensional problem
- time transportation problem
- trade-off problem
- traffic problem
- transport problem
- transportation problem
- traveling salesman problem
- trouble-location problem
- troubleshooting problem
- unconstrained problem
- undecidable problem
- underdetermined problem
- unsolvable problem
- unstructured problem
- variational problem
- vessel loading problem
- waiting line problem
- weak bridge problem
- well-behaved problem
- well-defined problem
- well-posed problemEnglish-Russian dictionary of computer science and programming > problem
-
5 DPP
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > DPP
См. также в других словарях:
Dining philosophers problem — In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra… … Wikipedia
Dining philosophers problem — Aufbau des Philosophenproblems Es handelt sich bei dem Philosophenproblem (engl. Dining Philosophers Problem) um ein Fallbeispiel aus dem Bereich der Theoretischen Informatik. Dabei soll das Problem der Nebenläufigkeit erklärt werden, und die… … Deutsch Wikipedia
Dining cryptographers problem — In cryptography, the dining cryptographers problem studies how to perform a secure multi party computation of the boolean OR function. David Chaum first proposed this problem in 1988, and used it as an illustrative example to show it was possible … Wikipedia
Producer-consumer problem — In computer science, the producer consumer problem (also known as the bounded buffer problem) is a classical example of a multi process synchronization problem. The problem describes two processes, the producer and the consumer, who share a… … Wikipedia
Sleeping barber problem — In computer science, the sleeping barber problem is a classic inter process communication and synchronization problem between multiple operating system processes. The problem is analogous to that of keeping a barber working when there are… … Wikipedia
Readers-writers problem — In computer science, the first and second readers writers problems are examples of a common computing problem in concurrency. The two problems deal with situations in which many threads must access the same shared memory at one time, some reading … Wikipedia
Rendezvous problem — The rendezvous dilemma is related to the prisoner s dilemma and can be formulated in this way::Two young people have a date in a park they have never been to before. Arriving separately in the park, they are both surprised to discover that it is… … Wikipedia
Speisende Philosophen — Aufbau des Philosophenproblems Es handelt sich bei dem Philosophenproblem (engl. Dining Philosophers Problem) um ein Fallbeispiel aus dem Bereich der Theoretischen Informatik. Dabei soll das Problem der Nebenläufigkeit erklärt werden, und die… … Deutsch Wikipedia
Philosophenproblem — Aufbau des Philosophenproblems Beim Philosophenproblem (engl. Dining Philosophers Problem) handelt es sich um ein Fallbeispiel aus dem Bereich der Theoretischen Informatik. Damit soll das Problem der Nebenläufigkeit erklärt werden und die Gefahr… … Deutsch Wikipedia
Semaphore (programming) — For other uses, see Semaphore (disambiguation). In computer science, a semaphore is a variable or abstract data type that provides a simple but useful abstraction for controlling access by multiple processes to a common resource in a parallel… … Wikipedia
Проблема обедающих философов — «Проблема обедающих философов» классический пример, используемый в информатике для иллюстрации проблем синхронизации в дизайне параллельных алгоритмов и техник решения этих проблем. Проблема была сформулирована в 1965 году Эдсгером… … Википедия
